An active-set trust-region algorithm for solving warehouse location problem
نویسندگان
چکیده
منابع مشابه
An Active-Set Trust-Region Algorithm for Solving Constrained Multi-Objective Optimization Problem
In this paper, the multi-objective optimization problem with equality and inequality constraints is solved by using interactive sequential optimization technique (I-SHOT) which convert the constrained multi-objective optimization problem to a single objective optimization problem with equality and inequality constraints. A trust-region algorithm for solving a single objective optimization probl...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولA Trust Region Algorithm for Solving Nonlinear Equations (RESEARCH NOTE)
This paper presents a practical and efficient method to solve large-scale nonlinear equations. The global convergence of this new trust region algorithm is verified. The algorithm is then used to solve the nonlinear equations arising in an Expanded Lagrangian Function (ELF). Numerical results for the implementation of some large-scale problems indicate that the algorithm is efficient for these ...
متن کاملEfficiently Solving the Fractional Trust Region Problem
Normalized Cuts has successfully been applied to a wide range of tasks in computer vision, it is indisputably one of the most popular segmentation algorithms in use today. A number of extensions to this approach have also been proposed, ones that can deal with multiple classes or that can incorporate a priori information in the form of grouping constraints. It was recently shown how a general l...
متن کاملA Genetic Algorithm for Solving Multiple Warehouse Layout Problem
In this paper we present a genetic algorithm (GA) for solving NP-hard Multiple Warehouse Layout Problem (MLWLP). New encoding scheme with appropriate objective functions is implemented. Specific representation and modified genetic operators keep individuals correct and help in restoring good genetic material and avoiding premature convergence in suboptimal solutions. The algorithm is tested on ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Taibah University for Science
سال: 2017
ISSN: 1658-3655
DOI: 10.1016/j.jtusci.2016.04.003